The Erdős-Ko-Rado theorem for the derangement graph of the projective general linear group acting on the projective space
نویسندگان
چکیده
منابع مشابه
On the stability of the Erdős-Ko-Rado theorem
Delete the edges of a Kneser graph independently of each other with some probability: for what probabilities is the independence number of this random graph equal to the independence number of the Kneser graph itself? We prove a sharp threshold result for this question in certain regimes. Since an independent set in the Kneser graph is the same as a uniform intersecting family, this gives us a ...
متن کامل“the effect of risk aversion on the demand for life insurance: the case of iranian life insurance market”
abstract: about 60% of total premium of insurance industry is pertained?to life policies in the world; while the life insurance total premium in iran is less than 6% of total premium in insurance industry in 2008 (sigma, no 3/2009). among the reasons that discourage the life insurance industry is the problem of adverse selection. adverse selection theory describes a situation where the inf...
15 صفحه اولsurvey on the rule of the due & hindering relying on the sheikh ansaris ideas
قاعده مقتضی و مانع در متون فقهی کم و بیش مستند احکام قرار گرفته و مورد مناقشه فقهاء و اصولیین می باشد و مشهور معتقند مقتضی و مانع، قاعده نیست بلکه یکی از مسائل ذیل استصحاب است لذا نگارنده بر آن شد تا پیرامون این قاعده پژوهش جامعی انجام دهد. به عقیده ما مقتضی دارای حیثیت مستقلی است و هر گاه می گوییم مقتضی احراز شد یعنی با ماهیت مستقل خودش محرز گشته و قطعا اقتضاء خود را خواهد داشت مانند نکاح که ...
15 صفحه اولA product version of the Erdős-Ko-Rado theorem
Let F1, . . . ,Fr ⊂ ([n] k ) be r-cross t-intersecting, that is, |F1 ∩ ·· · ∩Fr| ≥ t holds for all F1 ∈ F1, . . . ,Fr ∈ Fr. We prove that for every p,μ ∈ (0,1) there exists r0 such that for all r > r0, all t with 1 ≤ t < (1/p− μ)r−1/(1− p)−1, there exist n0 and ε so that if n > n0 and |k/n− p|< ε , then |F1| · · · |Fr| ≤ (n−t k−t )r .
متن کاملA generalization of the Erdős-Ko-Rado Theorem
In this note, we investigate some properties of local Kneser graphs defined in [8]. In this regard, as a generalization of the Erdös-Ko-Rado theorem, we characterize the maximum independent sets of local Kneser graphs. Next, we present an upper bound for their chromatic number.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2019
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2019.02.015